|
In the mathematical field of graph theory, a spanning tree ''T'' of an undirected graph ''G'' is a subgraph that includes all of the vertices of ''G'' that is a tree. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (but see Spanning forests below). If all of the edges of ''G'' are also edges of a spanning tree ''T'' of ''G'', then ''G'' is a tree and is identical to ''T'' (that is, a tree has a unique spanning tree and it is itself). ==Applications== Several pathfinding algorithms, including Dijkstra's algorithm and the A * search algorithm, internally build a spanning tree as an intermediate step in solving the problem. In order to minimize the cost of power networks, wiring connections, piping, automatic speech recognition, etc., people often use algorithms that gradually build a spanning tree (or many such trees) as intermediate steps in the process of finding the minimum spanning tree.〔 R. L. Graham and Pavol Hell. ("On the History of the Minimum Spanning Tree Problem" ). 1985. 〕 The Internet and many other telecommunications networks have transmission links that connect nodes together in a mesh topology that includes some loops. In order to "avoid bridge loops and "routing loops", many routing protocols designed for such networks -- including the Spanning Tree Protocol, Open Shortest Path First, Link-state routing protocol, Augmented tree-based routing, etc. -- require each router to remember a spanning tree. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Spanning tree」の詳細全文を読む スポンサード リンク
|